Dependency Parsers for Indian Languages
نویسنده
چکیده
This paper reports about our work in the ICON 2009 NLP TOOLS CONTEST: Parsing. We submitted two runs for Bengali. A statistical CRF based model followed by a rule-based post-processing technique has been used. The system has been trained on the NLP TOOLS CONTEST: ICON 2009 datasets. The system demonstrated an unlabeled attachment score (UAS) of 74.09%, labeled attachment score (LAS) of 53.90% and labeled accuracy score (LS) of 61.71% respectively.
منابع مشابه
Maximum Spanning Malt: Hiring World’s Leading Dependency Parsers to Plant Indian Trees
We present our system used for participation in the ICON 2009 NLP Tools Contest: dependency parsing of Hindi, Bangla and Telugu. The system consists of three existing, freely available dependency parsers, two of which (MST and Malt) have been known to produce state-of-the-art structures on data sets for other languages. Various settings of the parsers are explored in order to adjust them for th...
متن کاملHindi Dependency Parsing using a combined model of Malt and MST
In this paper we present our experiments in parsing Hindi. We first explored Malt and MST parsers. Considering pros of both these parsers, we developed a hybrid approach combining the output of these two parsers in an intuitive manner. We report our results on both development and test data provided in the Hindi Shared Task on Parsing at workshop on MT and parsing in Indian Languages, Coling 20...
متن کاملCost Effective Dependency Parsing for Indian Languages
Indian languages are MoR-FWO1 and hence differ from English in structure and morphology. There are many distinguished characteristics possessed by Indian languages. While working with these languages we have to keep in mind, these characteristics and plan strategies accordingly. We worked on improving Dependency Parsing for Indian Languages, more specifically for Hindi, an Indo-Aryan Language. ...
متن کاملEnsembling Various Dependency Parsers: Adopting Turbo Parser for Indian Languages
In this paper, we describe our experiments on applying combination of Malt, MST and Turbo Parsers for Hindi dependency parsing as part of a shared task at MTPIL 2012 Workshop, COLING 2012. We explore the usage and adoption of the recently released Turbo Parser for parsing Indian languages. Various configurations of each parser are explored before combination in order to adjust them for two diff...
متن کاملMulti-Source Transfer of Delexicalized Dependency Parsers
We present a simple method for transferring dependency parsers from source languages with labeled training data to target languages without labeled training data. We first demonstrate that delexicalized parsers can be directly transferred between languages, producing significantly higher accuracies than unsupervised parsers. We then use a constraint driven learning algorithm where constraints a...
متن کاملLiterature Survey: Bilingual Dependency Parsing and Disambiguation of Prepositional Phrase Attachments
Delexicalized parsers have been used to directly transfer between languages, producing significantly higher accuracies than unsupervised parsers (McDonald et al., 2006). The authors use a constraint driven learning algorithm where constraints are drawn from parallel corpora to project the final parser. They show that simple methods for introducing multiple source languages improve the overall q...
متن کامل